A basic theory with predicates

Atom Predicates and Set Predicates: Towards a General Theory of Plural Quantification

The interpretation of sentences with plural determiners and collective predicates is a highly complex problem that has not been sufficiently investigated, despite many advances in theories of plurality and quantification. This paper proposes a new typology of predicates that serves as a basis for a general treatment of singular and plural noun phrases within generalized quantifier theory. Secti...

Exploring the basic elements of successful knowledge management system with presenting a theory through a semantic network

Abstract: Nowadays knowledge is recognized as an important enabler for competitive advantages and many companies are beginning to establish knowledge management systems. Within the last few years many organizations tried to design a suitable knowledge management system and many of them were successful. This paper is to discover critical success factors (CSF) of knowledge management (KM) and the...

A mechanizable theory for existence proofs of inclusive predicates

Basic Graph Theory with Applications to Economics

Let N = {1, . . . , n} be a finite set. Let E be a collection of ordered or unordered pairs of distinct 1 elements from N . A graph G is defined by (N,E). The elements of N are called vertices of graph G. The elements of E are called edges of graph G. If E consists of ordered pairs of vertices, then the graph is called a directed graph (digraph). When we say graph, we refer to undirected graph,...

Filtering with Approximate Predicates

Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predicate) we can first check if the point is within a bounding rectangle (approximate predicate). In general, approximate predicates may have false positive and false negative errors. In this paper we study the problem of s...